On homogeneous Zeilberger recurrences
نویسندگان
چکیده
منابع مشابه
Sharp upper bounds for the orders of the recurrences output by the Zeilberger and q-Zeilberger algorithms
We do what the title promises, and as a bonus, we get much simplified versions of these algorithms, that do not make any explicit mention of Gosper’s algorithm. © 2004 Elsevier Ltd. All rights reserved.
متن کاملMulti-Variable Zeilberger and Almkvist-Zeilberger Algorithms and the Sharpening of Wilf-Zeilberger Theory
Superficially, this article, dedicated with friendship and admiration to Amitai Regev, has nothing to do with either Polynomial Identity Rings, Representation Theory, or Young tableaux, to all of which he made so many outstanding contributions. But anyone who knows even a little about Amitai Regev’s remarkable and versatile research, would know that both sums (and multi-sums!), and especially i...
متن کاملThe Abel-Zeilberger Algorithm
We use both Abel’s lemma on summation by parts and Zeilberger’s algorithm to find recurrence relations for definite summations. The role of Abel’s lemma can be extended to the case of linear difference operators with polynomial coefficients. This approach can be used to verify and discover identities involving harmonic numbers and derangement numbers. As examples, we use the Abel-Zeilberger alg...
متن کاملDeconstructing the Zeilberger algorithm
By looking under the hood of Zeilberger’s algorithm, as simplified by Mohammed and Zeilberger, it is shown that all the classical hypergeometric closed-form evaluations can be discovered ab initio, as well as many “strange” ones of Gosper, Maier, and Gessel and Stanton. The accompanying Maple package FindHypergeometric explains the various miracles that account for the classical evaluations, an...
متن کاملOn a Rado Type Problem for Homogeneous Second Order Linear Recurrences
In this paper we introduce a Ramsey type function S(r; a, b, c) as the maximum s such that for any r-coloring of N there is a monochromatic sequence x1, x2, . . . , xs satisfying a homogeneous second order linear recurrence axi + bxi+1 + cxi+2 = 0, 1 6 i 6 s − 2. We investigate S(2; a, b, c) and evaluate its values for a wide class of triples (a, b, c).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Mathematics
سال: 2008
ISSN: 0196-8858
DOI: 10.1016/j.aam.2006.03.004